An exact and scalable problem decomposition for security-constrained optimal power flow

In this paper, we present decomposition techniques for solving large-scale instances of the security-constrained optimal power flow (SCOPF) problem with primary response. Specifically, under each contingency state, require that nodal demands are met and synchronized units generating below their limits follow a linear model The resulting formulation is mixed-integer program since response introduces disjunctions to SCOPF problem. Unfortunately, exact methods relying on traditional Benders do not scale well. As an alternative, propose scheme based column-and-constraint-generation algorithm where iteratively add cuts. We provide procedures preprocessing dedicated cuts numerically determining post-contingency responses master solutions. also discuss heuristics generate high-quality primal solutions upper bounds method. Finally, demonstrate efficiency proposed method systems.